Warped discrete-Fourier transform: Theory and applications
نویسندگان
چکیده
منابع مشابه
Warped Discrete-Fourier Transform: Theory and Applications
In this paper, we advance the concept of warped discrete-Fourier transform (WDFT), which is the evaluation of frequency samples of the -transform of a finite-length sequence at nonuniformly spaced points on the unit circle obtained by a frequency transformation using an allpass warping function. By factorizing the WDFT matrix, we propose an exact computation scheme for finite sequences using le...
متن کاملEstimation of frequency offset using warped discrete-Fourier transform
In this paper, the problem of estimating a small frequency offset in a signal with a large carrier frequency is addressed. The warped discrete-Fourier transform (WDFT) [A. Makur, S.K. Mitra, IEEE Trans. Circuits Systems—I: Fundam. Theory Appl. 6 (9) (September 2001) 1086–1093] is used and the accuracy of estimation and computational complexity of this technique is compared with the conventional...
متن کاملDft : Discrete Fourier Transform
A. Table of contents by sections: 1. Abstract (you’re reading this now) 2. Summary of the DFT (How do I do the homework?) 3. Review of continuous-time Fourier series 4. Bandlimited signals and finite Fourier series 5. Sampling theorem for periodic signals 6. Review of quirks of discrete-time frequency 7. Orthogonality and its significance 8. Discrete Fourier Transform (DFT) 9. Use of DFT to com...
متن کاملThe Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملThe Discrete Fourier Transform
Disclaimer: These notes are intended to be an accessible introduction to the subject, with no pretense at completeness. In general, you can find more thorough discussions in Oppenheim's book. Please let me know if you find any typos. In this lecture, we discuss the Discrete Fourier Transform (DFT), which is a fourier representation for finite length signals. The main practical importance of thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
سال: 2001
ISSN: 1057-7122
DOI: 10.1109/81.948436